Edsger W . Dijkstra Prize in Distributed Computing
نویسندگان
چکیده
In 1985 Fischer, Lynch, and Paterson (FLP) proved that consensus is not attainable in asynchronous message passing systems with failures. In the following years, Loui and Abu-Amara, and Herlihy proved that solving consensus in an asynchronous shared memory system is harder than implementing a read/write register. However, it was not known whether read/ write registers are implementable in asynchronous message-passing systems with failures. Hagit Attiya, Amotz Bar-Noy, and Danny Dolev’s paper (ABD) answered this fundamental question affirmatively.
منابع مشابه
The 2010 Edsger W. Dijkstra Prize in Distributed Computing
The ACM-EATCS Edsger W. Dijkstra Prize in Distributed Computing was created to acknowledge outstanding papers on the principles of distributed computing whose significance and impact on the theory or practice of distributed computing have been evident for at least a decade. The Prize is sponsored jointly by the ACM Symposium on Principles of Distributed Computing (PODC) and the EATCS Symposium ...
متن کامل44 2011 in Review Idit Keidar
The last column of the year is dedicated, as always, to a review of distributed computing awards and conferences in 2011. The 2011 Edsger W. Dijkstra Prize in Distributed Computing was awarded to Hagit Attiya, Amotz Bar-Noy, and Danny Dolev, for their fundamental work on Sharing Memory Robustly in Message-Passing Systems , which appeared in the Journal of the ACM (JACM) 42(1):124-142 (1995). Th...
متن کاملIn Memoriam: Edsger Wybe Dijkstra
Edsger Wybe Dijkstra, Professor Emeritus in the Department of Computer Sciences at The University of Texas at Austin, died of cancer on 6 August 2002 at his home in Nuenen, the Netherlands. Dijkstra was a towering figure whose scientific contributions permeate major domains of computer science. He was a thinker, scholar, and teacher in renaissance style: working alone or in a close-knit group o...
متن کامل